A marching cube algorithm based on edge growth

The marching cube algorithm is currently one of the most popular three-dimensional (3D) reconstruction surface rendering algorithms. It forms voxels based on an input image and then uses 15 basic topological configurations to extract isosurfaces from voxels. processes each voxel in a traversal-based manner, but it does not consider relationship between adjacent cubes. Owing ambiguity, final reconstructed model may have holes. In this paper, we propose edge growth. first extracts seed triangles, grows these reconstructs entire 3D model. According position growth edge, 17 with isosurfaces. results showed that can reconstruct well. When only main contour required, performs addition, when there are multiple scattered parts data, contours connected by setting region selected seed.